Large Groups and Their Periodic Quotients
نویسنده
چکیده
We first give a short group theoretic proof of the following result of Lackenby. If G is a large group, H is a finite index subgroup of G admitting an epimorphism onto a non–cyclic free group, and g is an element of H, then the quotient of G by the normal subgroup generated by g n is large for all but finitely many n ∈ Z. In the second part of this note we use similar methods to show that for every infinite sequence of primes (p 1 , p 2 ,. . .
منابع مشابه
Periodic Quotients of Hyperbolic and Large Groups
Let G be either a non-elementary (word) hyperbolic group or a large group (both in the sense of Gromov). In this paper we describe several approaches for constructing continuous families of periodic quotients of G with various properties. The first three methods work for any non-elementary hyperbolic group, producing three different continua of periodic quotients of G. They are based on the res...
متن کاملPeriodic Quotients of Free-like Groups
Let G be a free-like group, meaning that G is either non-elementary (word) hyperbolic or G is large (in the sense of Gromov). In this paper we suggest several approaches to construct continuous families of periodic quotients of G which enjoy various properties. The first three methods work for any non-elementary hyperbolic group, producing three different continua of periodic quotients of G. Th...
متن کاملSchrödinger operators with strong magnetic fields: Quasi-periodicity of spectral orbits and topology
We investigate the large λ behavior of σ((p−λA)2) when the zero set of B = dA has a non-empty interior. With certain technical hypotheses we show that if either B is bounded away from zero for large |x| or periodic and certain quotients of standard homology groups are finite rank, then σ((p − λA)2) approaches a quasi-periodic orbit in the space of subsets of [0,∞).
متن کاملPeriodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملSmall cancellation theory and Burnside problem
In these notes we detail the geometrical approach of small cancellation theory used by T. Delzant and M. Gromov to provide a new proof of the infiniteness of free Burnside groups and periodic quotients of torsion-free hyperbolic groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006